Shallow Linear Action Graphs and their Embeddings

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi. Received October 2000 / Accepted in revised form April 2001     

Network topology and the theory of rubber elasticity

The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters.     

图书馆图书管理系统分析与设计

图书馆作为一个专门收集、整理、保存、传播文献 ,并提供利用的科学、文化、教育机构 ,是人们获取知识的主要来源之一。发展至今已有数千年的历史。然而 ,在信息技术迅速普及的今天 ,越来越多的读者希望通过网络更方便、更快捷地进行图书的查阅、借阅 ,获取自己的所需 ,因此图书馆的信息化建设尤为重要     

WLAN网管系统的现状和发展

2001年以来，全球WLAN（无线局域网）市场应用的瓶颈被打破，中国也迎来了WLAN商业化运作和服务的春天，WLAN为我们带来了一种全新的、灵活的工作方式，同时也带来了新的挑战，本文将对WLAN网络管理的主要内容和具体指标进行阐述，并对各大厂商的WLAN网管产品进行简单介绍和比较。     

低潮时期宽带网建设需要注意的问题

宽带建设低潮期实际上是一次优胜劣汰的过程,宽带运营竞争的手段将由低价竞争转向服务质量和特色的竞争。应在重视宽带接入建设的同时,也要重视业务运营管理平台的建设。应从长远考虑,不应仅为了节省投资而降低对设备的要求。由于降低成本的主要方向是在线缆部分,因此EVDSL技术应用的速度将大大超过人们的预期。在网络建设上,IPDSLAM虽有优势但也有不足,还需要进一步的成熟、稳定和实践的检验。     

地震勘探技术在焉耆盆地勘探开发中的合理应用探讨

地震勘探技术应用可以分为以二维地震研究构造为主的地震勘探初级阶段、以地震地层学为主的地震勘探中级阶段、以三维地震油藏静态描述为主的地震勘探高级阶段、以地震储层研究为主的开发地震妆级阶段和以四维地震进行油藏监测为主的开发地震高级阶段。针对5个不同阶段的地质条件和地质任务，选择使用合理的地震勘探技术是有效提高勘探开发效益的重要途径。焉耆盆地的勘探开发体现了以地震勘探为主的思路，在勘探开发过程中重视了针对不同勘探开发阶段和不同的地质 地震技术，因此，在早期勘探开发中取得了很好的经济效益。     

软交换技术的发展及其应用

软交换是下一代网络NGN的核心技术，本文从软交换的概念入手，介绍了软交换的基本功能及其优点．软交换的网络系统结构、软交换的对外接口等内容，并探讨了软交换技术的应用。     

RanGen: A Random Network Generator for Activity-on-the-Node Networks

In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.     

基于网络环境的计算机资料室工作

随着信息技术的迅速发展,基于网络的信息资源共享已成为信息化社会的基本特征。数字化图书馆和电子期刊网的出现,正在改变着人们的阅读习惯,丰富的信息资源和跨时空的浏览方式彻底颠覆了传统的图书馆、资料室的服务模式。同时,数字化图书馆也给资料室管理模式创新带来了新的契机。分析了院系资料室面临的挑战与机遇,探讨了新形势下计算机资料室工作,提出了利用信息技术,改革服务方式,拓展服务内容,提高服务水平,提供有特色的专业服务。     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.